int inorder(treenode t, int* value)
{
  int a;
  if(t==NULL)
      return 0;
 
  a = inorder(t->left, value);
    
  (*value) += (t->value) * 2^a;    
      
  (*value) = inorder(t->right, value);
  
  return (a+1);
    
}

int main()
{

	return 0;
}